ordering of trees by multiplicative second zagreb index
Authors
abstract
for a graph $g$ with edge set $e(g)$, the multiplicative second zagreb index of $g$ is defined as $pi_2(g)=pi_{uvin e(g)}[d_g(u)d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$. in this paper, we identify the eighth class of trees, with the first through eighth smallest multiplicative second zagreb indeces among all trees of order $ngeq 14$.
similar resources
On trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
full textMultiplicative Zagreb Indices of Trees
Let G be a graph with vertex set V (G) and edge set E(G) . The first and second multiplicative Zagreb indices of G are Π1 = ∏ x∈V (G) deg(x) 2 and Π2 = ∏ xy∈E(G) deg(x) deg(y) , respectively, where deg(v) is the degree of the vertex v . Let Tn be the set of trees with n vertices. We determine the elements of Tn , extremal w.r.t. Π1 and Π2 . AMS Mathematics Subject Classification (2000): 05C05, ...
full textOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
full texton trees and the multiplicative sum zagreb index
for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...
full textMultiplicative Zagreb indices of k-trees
Let G be a graph with vetex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is ∏ 1,c(G) = ∏ v∈V (G) d(v) , for a real number c > 0, and the second multiplicative Zagreb index is ∏ 2(G) = ∏ uv∈E(G) d(u)d(v), where d(u), d(v) are the degrees of the vertices of u, v. The multiplicative Zagreb indices have been the focus of considerable research in computational ...
full textMultiplicative Versions of First Zagreb Index
The first Zagreb index of a graph G, with vertex set V (G) and edge set E(G), is defined as M1(G) = ∑ u∈V (G) d(u) 2 where d(u) denotes the degree of the vertex v. An alternative expression for M1(G) is ∑ uv∈E(G)[d(u) + d(v)]. We consider a multiplicative version of M1 defined as Π∗1(G) = ∏ uv∈E(G)[d(u) + d(v)]. We prove that among all connected graphs with a given number of vertices, the path ...
full textMy Resources
Save resource for easier access later
Journal title:
transactions on combinatoricsPublisher: university of isfahan
ISSN 2251-8657
volume 5
issue 1 2016
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023